Communication E cient Secret Sharing
نویسندگان
چکیده
A secret sharing scheme is a method to store information securely and reliably. Particularly, in the threshold secret sharing scheme (due to Shamir), a secret is divided into shares, encoded and distributed to parties, such that any large enough collection of parties can decode the secret, and a smaller (then threshold) set of parties cannot collude to deduce any information about the secret. While Shamir’s scheme was studied for more than 35 years, the question of minimizing its communication bandwidth was not considered. Specifically, assume that a user (or a collection of parties) wishes to decode the secret by receiving information from a set of parties; the question we study is how to minimize the total amount of communication between the user and the parties. We prove a tight lower bound on the amount of communication necessary for decoding, and construct secret sharing schemes achieving the bound. The key idea for achieving optimal communication bandwidth is to let the user receive information from more than the necessary number of parties. In contrast, the current paradigm in secret sharing schemes is to decode from a minimum set of parties. Hence, existing secret sharing schemes are not optimal in terms of communication bandwidth. In addition, we consider secure distributed storage where our proposed communication e cient secret sharing schemes improve disk access complexity during decoding.
منابع مشابه
Optimal Construction of Unconditionally Secure ID-Based Key Sharing Scheme for Large-Scale Networks
E cient ID based key sharing schemes are desired world widely for secure communica tions on Internet and other networks The Key Predistiribution Systems KPS are a large class of such key sharing schemes The remarkable property of KPS is that in order to share the key a participant should only input its partner s identi er to its secret KPS algorithm Although it has a lot of advantages in terms ...
متن کاملGeneralized Zig-zag Functions and Oblivious Transfer Reductions
In this paper we show some e cient and unconditionally secure oblivious transfer reductions Our main tool is a class of functions that generalizes the Zig zag functions introduced by Brassard Crep eau and S antha in We show necessary and su cient conditions for the existence of such generalized functions and some characterizations in terms of well known combinatorial structures Moreover we poin...
متن کاملSecurity Analysis of a Hash-Based Secret Sharing Scheme
Secret sharing schemes perform an important role in protecting se-cret by sharing it among multiple participants. In 1979, (t; n) threshold secret sharing schemes were proposed by Shamir and Blakley independently. In a (t; n) threshold secret sharing scheme a secret can be shared among n partic-ipants such that t or more participants can reconstruct the secret, but it can not be reconstructed b...
متن کاملA Fast Publicly Verifiable Secret Sharing Scheme using Non-homogeneous Linear Recursions
A non-interactive (t,n)-publicly veriable secret sharing scheme (non-interactive (t,n)-PVSS scheme) is a (t,n)-secret sharing scheme in which anyone, not only the participants of the scheme, can verify the correctness of the produced shares without interacting with the dealer and participants. The (t,n)-PVSS schemes have found a lot of applications in cryptography because they are suitable for<...
متن کامل